The critical manifolds of inhomogeneous bond percolation on bow-tie and checkerboard lattices
نویسندگان
چکیده
We give a conditional derivation of the inhomogeneous critical percolation manifold of the bow-tie lattice with five different probabilities, a problem that does not appear at first to fall into any known solvable class. Although our argument is mathematically rigorous only on a region of the manifold, we conjecture that the formula is correct over its entire domain, and we provide a non-rigorous argument for this that employs the negative probability regime of the triangular lattice critical surface. We discuss how the rigorous portion of our result substantially broadens the range of lattices in the solvable class to include certain inhomogeneous and asymmetric bow-tie lattices, and that, if it could be put on a firm foundation, the negative probability portion of our method would extend this class to many further systems, including F Y Wu’s checkerboard formula for the square lattice. We conclude by showing that this latter problem can in fact be proved using a recent result of Grimmett and Manolescu for isoradial graphs, lending strong evidence in favor of our other conjectured results. This article is part of ‘Lattice models and integrability’, a special issue of Journal of Physics A: Mathematical and Theoretical in honour of F Y Wu’s 80th birthday. PACS numbers: 64.60.Ak, 05.20.−y, 89.75.Hc, 05.50.+q, 05.70.Jk (Some figures may appear in colour only in the online journal)
منابع مشابه
Exact bond percolation thresholds in two dimensions
Recent work in percolation has led to exact solutions for the site and bond critical thresholds of many new lattices. Here we show how these results can be extended to other classes of graphs, significantly increasing the number and variety of solved problems. Any graph that can be decomposed into a certain arrangement of triangles, which we call self-dual, gives a class of lattices whose perco...
متن کاملPercolation in networks with voids and bottlenecks.
A general method is proposed for predicting the asymptotic percolation threshold of networks with bottlenecks, in the limit that the subnet mesh size goes to zero. The validity of this method is tested for bond percolation on filled checkerboard and "stack-of-triangle" lattices. Thresholds for the checkerboard lattices of different mesh sizes are estimated using the gradient percolation method,...
متن کاملInhomogeneous Bond Percolation on Square, Triangular, and Hexagonal Lattices
The star–triangle transformation is used to obtain an equivalence extending over the set of all (in)homogeneous bond percolation models on the square, triangular, and hexagonal lattices. Amongst the consequences are box-crossing (RSW) inequalities for such models with parameter-values at which the transformation is valid. This is a step towards proving the universality and conformality of these...
متن کاملInhomogeneous Bond Percolation on Square, Triangular and Hexagonal Lattices by Geoffrey
The star–triangle transformation is used to obtain an equivalence extending over the set of all (in)homogeneous bond percolation models on the square, triangular and hexagonal lattices. Among the consequences are boxcrossing (RSW) inequalities for such models with parameter-values at which the transformation is valid. This is a step toward proving the universality and conformality of these proc...
متن کاملBond percolation critical probability bounds for three Archimedean lattices
Rigorous bounds for the bond percolation critical probability are determined for three Archimedean lattices: .7385 < pc((3, 12 ) bond) < .7449, .6430 < pc((4, 6, 12) bond) < .7376, .6281 < pc((4, 8 ) bond) < .7201. Consequently, the bond percolation critical probability of the (3, 12) lattice is strictly larger than those of the other ten Archimedean lattices. Thus, the (3, 12) bond percolation...
متن کامل